Refusal testing

Denotational Semantics for Probabilistic Refusal Testing

In this paper, refusal testing ideas are applied to deene a testing semantics for a probabilistic process algebra. A testing equivalence is deened by combining the greater discriminatory power of refusal testing and a simple treatment of the prob-abilistic component of processes. This testing equivalence is characterized by two fully abstract denotational semantics. The rst of them is based on ...

Ins and Outs in Refusal Testing

Interpretation and Partition Refinement for Model CheckingD. R. DamsFaculty of Mathematics and Computing Science, TUE, 1996-13 Topological Dualities in SemanticsM. M. BonsangueFaculty of Mathematics and Computer Science, VUA, 1996-14 Algorithms for Graphs of Small TreewidthB. L. E. de FluiterFaculty of Mathematics and Computer Science, UU, 1997-01 Process-algebraic Trans...

Stochastic Refusal Graph for Testing Non-Deterministic Systems

The test is one of the approaches commonly used for validating systems to ensure qualitative and quantitative implementation requirements. In this paper we are interested in refusals test based for testing stochastic systems. We propose a new kind of refusals graph named stochastic refusals graphs (SRG) for specification in maximality-based stochastic labeled transition systems (MSLTS) model. I...

Extending Refusal Testing by Stochastic Refusals for Testing Non-deterministic Systems

Testing is a validation activity used to check the system’s correctness with respect to the specification. In this context, test based on refusals is studied in theory and tools are effectively constructed. This paper addresses, a formal testing based on stochastic refusals graphs (SRG) in order to test stochastic system represented by maximality-based stochastic labeled transition systems (MSL...

School refusal and truancy.